An Improved Algorithm on Calculating the Minimum Dominating Connected Set for Efficient Routing in Ad hoc Wireless Network
نویسندگان
چکیده
This paper presents a new approach to compute the MCDS (Minimum Connected Dominating Set) for Mobile Ad hoc Network (MANET). The problem of finding a MCDS is NP-hard. This approach is based on linear programming theory. In first step, we formulate the problem to find the minimum dominating set as an integer linear programming problem. Next, we add constraints to the original problem to force the minimum dominating set to be a connected set. The effectiveness of the approach is confirmed through simulation study and comparison with other approaches.
منابع مشابه
A Heuristic Algorithm for Minimum Connected Dominating Set with Maximal Weight in Ad Hoc Networks
How to design a efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a minimum connected dominating set (MCDS) is a promising approach, where the search space for a route is reduced to nodes in the set (also called gateway nodes). So, to determine this set is a very vital problem. This paper introd...
متن کاملA Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks
Efficient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we...
متن کاملAn enhanced approach to determine connected dominating sets for routing in mobile ad hoc networks
A mobile ad hoc network is a collection of wireless mobile nodes forming a temporary network without the support of any established infrastructure or centralised administration. Mobile ad hoc networks face a lot of challenges for designing a scalable routing protocol due to their natural characteristics. The IDea of virtual backbone routing has been proposed for efficient routing in mobile ad h...
متن کاملBroadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach
While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...
متن کاملA Dominating-set-based Routing Scheme in Ad Hoc Wireless Networks 1
E cient routing among a set of mobile hosts (also called nodes) is one of the most important functions in ad-hoc wireless networks. Routing based on a connected dominating set is a promising approach, where the searching space for a route is reduced to nodes in the set. A set is dominating if all the nodes in the system are either in the set or neighbors of nodes in the set. In this paper, we p...
متن کامل